0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.12/0.32 % Computer : n026.cluster.edu 0.12/0.32 % Model : x86_64 x86_64 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.32 % Memory : 8042.1875MB 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.32 % CPULimit : 1920 0.12/0.32 % WCLimit : 240 0.12/0.33 % DateTime : Wed Jul 30 03:23:49 EDT 2025 0.12/0.33 % CPUTime : 0.20/0.47 Running higher-order theorem proving 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.YqjK9fL13J/E---3.1_18678.p 0.36/0.55 # Version: 3.0.0-ho 0.36/0.55 # Preprocessing class: HSLSSLSSSSLCHSA. 0.36/0.55 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.36/0.55 # Starting new_ho_10 with 1200s (5) cores 0.36/0.55 # Starting sh5l with 240s (1) cores 0.36/0.55 # Starting new_bool_1 with 240s (1) cores 0.36/0.55 # Starting new_bool_2 with 240s (1) cores 0.36/0.55 # new_bool_2 with pid 18759 completed with status 0 0.36/0.55 # Result found by new_bool_2 0.36/0.55 # Preprocessing class: HSLSSLSSSSLCHSA. 0.36/0.55 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.36/0.55 # Starting new_ho_10 with 1200s (5) cores 0.36/0.55 # Starting sh5l with 240s (1) cores 0.36/0.55 # Starting new_bool_1 with 240s (1) cores 0.36/0.55 # Starting new_bool_2 with 240s (1) cores 0.36/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.36/0.55 # Search class: HGHSF-FFMS32-DHSFFSBN 0.36/0.55 # partial match(4): HGHSM-FSLM32-DHSFFSBN 0.36/0.55 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.36/0.55 # Starting full_lambda_3 with 111s (1) cores 0.36/0.55 # full_lambda_3 with pid 18760 completed with status 0 0.36/0.55 # Result found by full_lambda_3 0.36/0.55 # Preprocessing class: HSLSSLSSSSLCHSA. 0.36/0.55 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.36/0.55 # Starting new_ho_10 with 1200s (5) cores 0.36/0.55 # Starting sh5l with 240s (1) cores 0.36/0.55 # Starting new_bool_1 with 240s (1) cores 0.36/0.55 # Starting new_bool_2 with 240s (1) cores 0.36/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.36/0.55 # Search class: HGHSF-FFMS32-DHSFFSBN 0.36/0.55 # partial match(4): HGHSM-FSLM32-DHSFFSBN 0.36/0.55 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.36/0.55 # Starting full_lambda_3 with 111s (1) cores 0.36/0.55 # Preprocessing time : 0.004 s 0.36/0.55 0.36/0.55 # Proof found! 0.36/0.55 # SZS status Theorem 0.36/0.55 # SZS output start CNFRefutation 0.36/0.55 thf(decl_sort1, type, hF_Mirabelle_hf: $tType). 0.36/0.55 thf(decl_33, type, hF_Mirabelle_HBex: hF_Mirabelle_hf > (hF_Mirabelle_hf > $o) > $o). 0.36/0.55 thf(decl_46, type, hF_Mirabelle_hmem: hF_Mirabelle_hf > hF_Mirabelle_hf > $o). 0.36/0.55 thf(decl_73, type, a: hF_Mirabelle_hf). 0.36/0.55 thf(decl_74, type, p: $o). 0.36/0.55 thf(decl_75, type, esk1_0: hF_Mirabelle_hf). 0.36/0.55 thf(decl_89, type, esk15_2: hF_Mirabelle_hf > (hF_Mirabelle_hf > $o) > hF_Mirabelle_hf). 0.36/0.55 thf(fact_2_hbexE, axiom, ![X333:hF_Mirabelle_hf, X104:hF_Mirabelle_hf > $o]:((~(![X67:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ X67 @ X333)=>~((X104 @ X67)))))<=(hF_Mirabelle_HBex @ X333 @ X104))), file('/export/starexec/sandbox2/tmp/tmp.YqjK9fL13J/E---3.1_18678.p', fact_2_hbexE)). 0.36/0.55 thf(conj_0, conjecture, ((hF_Mirabelle_HBex @ a @ (^[X3:hF_Mirabelle_hf]:((p))))<=>(?[X3:hF_Mirabelle_hf]:((hF_Mirabelle_hmem @ X3 @ a))&(p))), file('/export/starexec/sandbox2/tmp/tmp.YqjK9fL13J/E---3.1_18678.p', conj_0)). 0.36/0.55 thf(fact_1_hbexI, axiom, ![X104:hF_Mirabelle_hf > $o, X4:hF_Mirabelle_hf, X258:hF_Mirabelle_hf]:((((hF_Mirabelle_HBex @ X258 @ X104)<=(hF_Mirabelle_hmem @ X4 @ X258))<=(X104 @ X4))), file('/export/starexec/sandbox2/tmp/tmp.YqjK9fL13J/E---3.1_18678.p', fact_1_hbexI)). 0.36/0.55 thf(c_0_3, plain, ![X333:hF_Mirabelle_hf, X104:hF_Mirabelle_hf > $o]:(((hF_Mirabelle_HBex @ X333 @ X104)=>~(![X67:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ X67 @ X333)=>~(X104 @ X67)))))), inference(fof_simplification,[status(thm)],[fact_2_hbexE])). 0.36/0.55 thf(c_0_4, negated_conjecture, ~(((hF_Mirabelle_HBex @ a @ (^[Z0/* 3 */:hF_Mirabelle_hf]:((p))))<=>(?[X3:hF_Mirabelle_hf]:((hF_Mirabelle_hmem @ X3 @ a))&(p)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.36/0.55 thf(c_0_5, plain, ![X651:hF_Mirabelle_hf, X652:hF_Mirabelle_hf > $o]:((((hF_Mirabelle_hmem @ (esk15_2 @ X651 @ X652) @ X651)|~(hF_Mirabelle_HBex @ X651 @ X652))&((X652 @ (esk15_2 @ X651 @ X652))|~(hF_Mirabelle_HBex @ X651 @ X652)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])). 0.36/0.55 thf(c_0_6, negated_conjecture, ![X597:hF_Mirabelle_hf]:(((~(hF_Mirabelle_HBex @ a @ (^[Z0/* 3 */:hF_Mirabelle_hf]:((p))))|(~(hF_Mirabelle_hmem @ X597 @ a)|~(p)))&(((hF_Mirabelle_hmem @ esk1_0 @ a)|(hF_Mirabelle_HBex @ a @ (^[Z0/* 3 */:hF_Mirabelle_hf]:((p)))))&((p)|(hF_Mirabelle_HBex @ a @ (^[Z0/* 3 */:hF_Mirabelle_hf]:((p)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])). 0.36/0.55 thf(c_0_7, plain, ![X3:hF_Mirabelle_hf, X1:hF_Mirabelle_hf > $o]:(((X1 @ (esk15_2 @ X3 @ X1))|~((hF_Mirabelle_HBex @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.36/0.55 thf(c_0_8, negated_conjecture, ((p)|(hF_Mirabelle_HBex @ a @ (^[Z0/* 3 */:hF_Mirabelle_hf]:((p))))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.36/0.55 thf(c_0_9, negated_conjecture, ![X3:hF_Mirabelle_hf]:((~((hF_Mirabelle_HBex @ a @ (^[Z0/* 3 */:hF_Mirabelle_hf]:((p)))))|~((hF_Mirabelle_hmem @ X3 @ a))|~((p)))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.36/0.55 thf(c_0_10, negated_conjecture, (p), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.36/0.55 thf(c_0_11, negated_conjecture, ![X3:hF_Mirabelle_hf]:((~((hF_Mirabelle_HBex @ a @ (^[Z0/* 3 */:hF_Mirabelle_hf]:((p)))))|~((hF_Mirabelle_hmem @ X3 @ a)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])])). 0.36/0.55 thf(c_0_12, negated_conjecture, ((hF_Mirabelle_hmem @ esk1_0 @ a)|(hF_Mirabelle_HBex @ a @ (^[Z0/* 3 */:hF_Mirabelle_hf]:((p))))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.36/0.55 thf(c_0_13, plain, ![X104:hF_Mirabelle_hf > $o, X4:hF_Mirabelle_hf, X258:hF_Mirabelle_hf]:(((X104 @ X4)=>((hF_Mirabelle_hmem @ X4 @ X258)=>(hF_Mirabelle_HBex @ X258 @ X104)))), inference(fof_simplification,[status(thm)],[fact_1_hbexI])). 0.36/0.55 thf(c_0_14, negated_conjecture, ![X3:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ esk1_0 @ a)|~((hF_Mirabelle_hmem @ X3 @ a)))), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.36/0.55 thf(c_0_15, plain, ![X3:hF_Mirabelle_hf, X1:hF_Mirabelle_hf > $o]:(((hF_Mirabelle_hmem @ (esk15_2 @ X3 @ X1) @ X3)|~((hF_Mirabelle_HBex @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.36/0.55 thf(c_0_16, plain, ![X645:hF_Mirabelle_hf > $o, X646:hF_Mirabelle_hf, X647:hF_Mirabelle_hf]:((~(X645 @ X646)|(~(hF_Mirabelle_hmem @ X646 @ X647)|(hF_Mirabelle_HBex @ X647 @ X645)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])). 0.36/0.55 thf(c_0_17, negated_conjecture, ![X1:hF_Mirabelle_hf > $o]:(((hF_Mirabelle_hmem @ esk1_0 @ a)|~((hF_Mirabelle_HBex @ a @ X1)))), inference(spm,[status(thm)],[c_0_14, c_0_15])). 0.36/0.55 thf(c_0_18, plain, ![X1:hF_Mirabelle_hf > $o, X3:hF_Mirabelle_hf, X4:hF_Mirabelle_hf]:(((hF_Mirabelle_HBex @ X4 @ X1)|~((X1 @ X3))|~((hF_Mirabelle_hmem @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.36/0.55 thf(c_0_19, negated_conjecture, (hF_Mirabelle_hmem @ esk1_0 @ a), inference(spm,[status(thm)],[c_0_17, c_0_12])). 0.36/0.55 thf(c_0_20, negated_conjecture, ![X1:hF_Mirabelle_hf > $o]:(((hF_Mirabelle_HBex @ a @ X1)|~((X1 @ esk1_0)))), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.36/0.55 thf(c_0_21, negated_conjecture, ![X3:hF_Mirabelle_hf]:(~((hF_Mirabelle_hmem @ X3 @ a))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_20]), c_0_10])])). 0.36/0.55 thf(c_0_22, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_19, c_0_21]), ['proof']). 0.36/0.55 # SZS output end CNFRefutation 0.36/0.55 # Parsed axioms : 411 0.36/0.55 # Removed by relevancy pruning/SinE : 388 0.36/0.55 # Initial clauses : 60 0.36/0.55 # Removed in clause preprocessing : 0 0.36/0.55 # Initial clauses in saturation : 60 0.36/0.55 # Processed clauses : 81 0.36/0.55 # ...of these trivial : 1 0.36/0.55 # ...subsumed : 4 0.36/0.55 # ...remaining for further processing : 76 0.36/0.55 # Other redundant clauses eliminated : 17 0.36/0.55 # Clauses deleted for lack of memory : 0 0.36/0.55 # Backward-subsumed : 3 0.36/0.55 # Backward-rewritten : 4 0.36/0.55 # Generated clauses : 463 0.36/0.55 # ...of the previous two non-redundant : 441 0.36/0.55 # ...aggressively subsumed : 0 0.36/0.55 # Contextual simplify-reflections : 0 0.36/0.55 # Paramodulations : 427 0.36/0.55 # Factorizations : 4 0.36/0.55 # NegExts : 1 0.36/0.55 # Equation resolutions : 17 0.36/0.55 # Disequality decompositions : 0 0.36/0.55 # Total rewrite steps : 6 0.36/0.55 # ...of those cached : 4 0.36/0.55 # Propositional unsat checks : 0 0.36/0.55 # Propositional check models : 0 0.36/0.55 # Propositional check unsatisfiable : 0 0.36/0.55 # Propositional clauses : 0 0.36/0.55 # Propositional clauses after purity: 0 0.36/0.55 # Propositional unsat core size : 0 0.36/0.55 # Propositional preprocessing time : 0.000 0.36/0.55 # Propositional encoding time : 0.000 0.36/0.55 # Propositional solver time : 0.000 0.36/0.55 # Success case prop preproc time : 0.000 0.36/0.55 # Success case prop encoding time : 0.000 0.36/0.55 # Success case prop solver time : 0.000 0.36/0.55 # Current number of processed clauses : 54 0.36/0.55 # Positive orientable unit clauses : 5 0.36/0.55 # Positive unorientable unit clauses: 0 0.36/0.55 # Negative unit clauses : 7 0.36/0.55 # Non-unit-clauses : 42 0.36/0.55 # Current number of unprocessed clauses: 417 0.36/0.55 # ...number of literals in the above : 1366 0.36/0.55 # Current number of archived formulas : 0 0.36/0.55 # Current number of archived clauses : 8 0.36/0.55 # Clause-clause subsumption calls (NU) : 866 0.36/0.55 # Rec. Clause-clause subsumption calls : 547 0.36/0.55 # Non-unit clause-clause subsumptions : 3 0.36/0.55 # Unit Clause-clause subsumption calls : 28 0.36/0.55 # Rewrite failures with RHS unbound : 0 0.36/0.55 # BW rewrite match attempts : 2 0.36/0.55 # BW rewrite match successes : 2 0.36/0.55 # Condensation attempts : 81 0.36/0.55 # Condensation successes : 0 0.36/0.55 # Termbank termtop insertions : 26142 0.36/0.55 # Search garbage collected termcells : 3494 0.36/0.55 0.36/0.55 # ------------------------------------------------- 0.36/0.55 # User time : 0.022 s 0.36/0.55 # System time : 0.007 s 0.36/0.55 # Total time : 0.029 s 0.36/0.55 # Maximum resident set size: 2668 pages 0.36/0.55 0.36/0.55 # ------------------------------------------------- 0.36/0.55 # User time : 0.034 s 0.36/0.55 # System time : 0.009 s 0.36/0.55 # Total time : 0.043 s 0.36/0.55 # Maximum resident set size: 2460 pages 0.36/0.55 % E exiting 0.36/0.56 % E exiting 0.36/0.56 EOF